Refined estimates for some basic random walks on the symmetric and alternating groups
نویسندگان
چکیده
We give refined estimates for the discrete time and continuous time versions of some basic random walks on the symmetric and alternating groups Sn and An. We consider the following models: random transposition, transpose top with random, random insertion, and walks generated by the uniform measure on a conjugacy class. In the case of random walks on Sn and An generated by the uniform measure on a conjugacy class, we show that in continuous time the l-cuttoff has a lower bound of (n/2) log n. This result, along with the results of Müller, Schlage-Puchta and Roichman, demonstrates that the continuous time version of these walks may take much longer to reach stationarity than its discrete time counterpart.
منابع مشابه
Fuchsian groups, coverings of Riemann surfaces, subgroup growth, random quotients and random walks
Fuchsian groups (acting as isometries of the hyperbolic plane) occur naturally in geometry, combinatorial group theory, and other contexts. We use character-theoretic and probabilistic methods to study the spaces of homomorphisms from Fuchsian groups to symmetric groups. We obtain a wide variety of applications, ranging from counting branched coverings of Riemann surfaces, to subgroup growth an...
متن کاملLower estimates for random walks on a class of amenable p-adic groups
We give central lower estimates for the transition kernels corresponding to symmetric random walks on certain amenable p-adic groups.
متن کاملCharacters of Symmetric Groups: Sharp Bounds and Applications
We provide new estimates on character values of symmetric groups which hold for all characters and which are in some sense best possible. It follows from our general bound that if a permutation σ ∈ Sn has at most n cycles of length < m, then |χ(σ)| ≤ χ(1) for all irreducible characters χ of Sn. This is a far reaching generalization of a result of Fomin and Lulov. We then use our various charact...
متن کاملA PRELUDE TO THE THEORY OF RANDOM WALKS IN RANDOM ENVIRONMENTS
A random walk on a lattice is one of the most fundamental models in probability theory. When the random walk is inhomogenous and its inhomogeniety comes from an ergodic stationary process, the walk is called a random walk in a random environment (RWRE). The basic questions such as the law of large numbers (LLN), the central limit theorem (CLT), and the large deviation principle (LDP) are ...
متن کاملProbability on Groups: Random Walks and Invariant Diffusions, Volume 48, Number 9
968 NOTICES OF THE AMS VOLUME 48, NUMBER 9 W hat do card shuffling, volume growth, and Harnack inequalities have to do with each other? They all arise in the study of random walks on groups. Probability on groups is concerned with probability measures and random processes whose properties are dictated in part by an underlying group structure. It is a diverse area where one finds both sophistica...
متن کامل